The Complexity of Making Unique Choices: Approximating 1-in- k SAT
نویسندگان
چکیده
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate different special cases of the problem, including those obtained by restricting the literals to be unnegated and/or all clauses to have size exactly k. Our results show that the 1in-kSAT problem exhibits some rather peculiar phenomena in the realm of constraint satisfaction problems. Specifically, the problem becomes substantially easier to approximate with perfect completeness as well as when negations of literals are not allowed.
منابع مشابه
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster
The currently fastest known algorithm for k-SAT is PPSZ named after its inventors Paturi, Pudlák, Saks, and Zane [7]. Analyzing its running time is much easier for input formulas with a unique satisfying assignment. In this paper, we achieve three goals. First, we simplify Hertli’s 2011 analysis [1] for input formulas with multiple satisfying assignments. Second, we show a “translation result”:...
متن کاملThe Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
We provide some evidence that Unique k-SAT is as hard to solve as general k-SAT, where k-SAT denotes the satisfiability problem for k-CNFs with at most k literals in each clause and Unique k-SAT is the promise version where the given formula has 0 or 1 solutions. Namely, defining for each k > 1, sk = inf{δ > 0 | ∃ a O(2)-time randomized algorithm for k-SAT} and, similarly, σk = inf{δ > 0 | ∃ a ...
متن کاملConnecting the Complexities of Approximating Clique and TSP
This paper demonstrates a connection between the complexity of finding approximate solutions to the MaxClique problem and that of the Traveling Salesman Problem (TSP). The main result of the paper is: MaxClique≤m 2-approximating MaxClique =⇒ TSP≤m 2-approximating TSP, where ≤m denotes many-one reductions between functions. Previously, it was known that TSP ≤m -reduces to (1+n− )-approximating T...
متن کاملUnique k-SAT is as Hard as k-SAT
In this work we show that Unique k-SAT is as hard as k-SAT for every k ∈ N. This settles a conjecture by Calabro, Impagliazzo, Kabanets and Paturi [4]. To provide an affirmative answer to this conjecture, we develop a randomness optimal construction of Isolation Lemma for k-SAT.
متن کاملThe Power of Choice for Random Satisfiability
We consider Achlioptas processes for k-SAT formulas. We create a semi-random formula with n variables and m clauses, where each clause is a choice, made on-line, between two or more uniformly random clauses. Our goal is to delay the satisfiability/unsatisfiability transition, keeping the formula satisfiable up to densities m/n beyond the satisfiability threshold αk for random k-SAT. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005